Learning block-structured incoherent dictionaries for sparse representation
نویسندگان
چکیده
منابع مشابه
Sparse Approximation with Block Incoherent Dictionaries
Building good sparse approximations of functions is one of the major themes in approximation theory. When applied to signals, images or any kind of data, it allows to deal with basic building blocks that essentially synthesize all the information at hand. It is known since the early successes of wavelet analysis that sparse expansions very often result in efficient algorithms for characterizing...
متن کاملSparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result byDonoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We consider general (redundant) dictionaries in finite dimension, and derive sufficient conditions on a signal/image for having a unique sparse representation in such a dictionary. In particular, it is proved that the result of D...
متن کاملLearning of Graph Compressed Dictionaries for Sparse Representation Classification
Despite the limited target data available to design face models in video surveillance applications, many faces of non-target individuals may be captured in operational environments, and over multiple cameras, to improve robustness to variations. This paper focuses on Sparse Representation Classification (SRC) techniques that are suitable for the design of still-to-video FR systems based on unde...
متن کاملLearning Stable Multilevel Dictionaries for Sparse Representation of Images
Dictionaries adapted to the data provide superior performance when compared to predefined dictionaries in applications involving sparse representations. Algorithmic stability and generalization are desirable characteristics for dictionary learning algorithms that aim to build global dictionaries which can efficiently model any test data similar to the training samples. In this paper, we propose...
متن کاملSparse Estimation with Structured Dictionaries
In the vast majority of recent work on sparse estimation algorithms, performance has been evaluated using ideal or quasi-ideal dictionaries (e.g., random Gaussian or Fourier) characterized by unit l2 norm, incoherent columns or features. But in reality, these types of dictionaries represent only a subset of the dictionaries that are actually used in practice (largely restricted to idealized com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2015
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-014-5258-6